home *** CD-ROM | disk | FTP | other *** search
/ Developer Source 11 / developer source - volume 11.iso / exepc / sep96 / johnt101.gif < prev    next >
Graphics Interchange Format  |  1998-02-10  |  72KB  |  474x349  |  4-bit (16 colors)
Labels: text | screenshot | font | number
OCR: De Bruijn sequences can be represented by a necklace of coloured beads, For example, if we take the three colours red, blue and green which we can designate as R, B and G, then the de Bruijn sequence: BGBBGGBGBGGGG ( RRR. . . . .. ) where the bracket is a repeat of the sequence as it is circu- Jar, contains the 81 possible arrangements of four beads in three colours ie ARAB ARAG RABB RRRG RRGR RAGE RRGO RBRB RBAR RBBB RADG REGE RBGB RORR RORE RORG RGBB RGBQ RGGR EGGE :RGGG BARI BRR BABA BRBE BROR BRGB BRGG BERR BBRE BBRG BBAR BBBG BBGE BBGE BGRR BGRE BORG AGBR BGBQ BGGG GRRR GERD GRAG GRBR CRBE GRHG GROF GROB GBRE GBRB GBRG GEBR GBBB GBBO GBGR GORT GORB GGRG GOBR GGBB GGBG GOGR GGGG If you change "coloured beads' to letters', fixed number of colours' to alphabet' and overy arrangement of a given number of beads' to words of a given length' then you can say that this de Bruijn sequence contains all the four letter words that you can make from an alpha- bet containing only B, Gand R Figure 1 - A de Bruijn sequence.